Indefinite summation with unspecified summands
نویسندگان
چکیده
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr’s algorithm to a general summation framework by which additional types of summand expressions can be handled. Our treatment of unspecified sequences can be seen as a first illustrative application of this approach.
منابع مشابه
A New Sigma Approach to Multi-summation
We present a general algorithmic framework that allows not only to deal with summation problems over summands being rational expressions in indefinite nested sums and products (Karr 1981), but also over ∂-finite and holonomic summand expressions that are given by a linear recurrence. This approach implies new computer algebra tools implemented in Sigma to solve multi-summation problems efficien...
متن کاملA Note On the Minimality Problem in Indefinite Summation of Rational Functions
In particular, a solution of (1) with remainder r = 0 provides a closed form for g as a rational expression in a and b, namely g(a, b) = h(b+ 1)− h(a). Several algorithms are known for computing solutions of the indefinite rational summation problem (see [2, 1, 3]). Note that giving an “Ansatz” for the denominators of h and r reduces equation (1) to a polynomial equation, which can be solved by...
متن کاملIndefinite Summation and the Kronecker Delta
Indefinite summation, together with a generalized version of the Kronecker delta, provide a calculus for reasoning about various polynomial functions that arise in combinatorics, such as the Tutte, chromatic, flow, and reliability polynomials. In this paper we develop the algebraic properties of the indefinite summation operator and the generalized Kronecker delta from an axiomatic viewpoint. O...
متن کاملGosper’s Algorithm and Accurate Summation as Definite Summation Tools
Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper’s algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is inreased.
متن کاملAn Implementation of Karr’s Summation Algorithm in Mathematica∗
Implementations of the celebrated Gosper algorithm (1978) for indefinite summation are available on almost any computer algebra platform. We report here about an implementation of an algorithm by Karr, the most general indefinite summation algorithm known. Karr’s algorithm is, in a sense, the summation counterpart of Risch’s algorithm for indefinite integration. This is the first implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006